Advancing Mixture Models for Least Squares Optimization

نویسندگان

چکیده

Gaussian mixtures are a powerful and widely used tool to model non-Gaussian estimation problems. They able describe measurement errors that follow arbitrary distributions can represent ambiguity in assignment tasks like point set registration or tracking. However, using them with common least squares solvers is still difficult. Existing approaches either approximations of the true mixture prone convergence issues due their strong nonlinearity. We propose novel representation mixture, which an exact almost linear corresponding log-likelihood. Our approach provides efficient, accurate flexible for many probabilistic problems be as cost function solvers. demonstrate its superior performance various Monte Carlo experiments, including different kinds registration. implementation available open source code state-of-the-art Ceres GTSAM.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least Squares Optimization

The following is a brief review of least squares optimization and constrained optimization techniques, which are widely used to analyze and visualize data. Least squares (LS) optimization problems are those in which the objective (error) function is a quadratic function of the parameter(s) being optimized. The solutions to such problems may be computed analytically using the tools of linear alg...

متن کامل

Least Squares Optimization

Least squares (LS) problems are optimization problems in which the objective (error) function may be expressed as a sum of squares. Such problems have a natural relationship to distances in Euclidean geometry, and the solutions may be computed analytically using the tools of linear algebra. They can generally be interpreted and understood geometrically. They also have a statistical interpretati...

متن کامل

Least Squares Optimization

The following is a brief review of least squares optimization and constrained optimization techniques. I assume the reader is familiar with basic linear algebra, including the Singular Value decomposition (as reviewed in my handout Geometric Review of Linear Algebra). Least squares (LS) problems are those in which the objective function may be expressed as a sum of squares. Such problems have a...

متن کامل

Least Squares Optimization

The following is a brief review of least squares optimization and constrained optimization techniques. Broadly, these techniques can be used in data analysis and visualization to examine the relationships between variables. Least squares (LS) problems are optimization problems in which the objective (error) function may be expressed as a sum of squares. Such problems have a natural relationship...

متن کامل

Least Squares Optimization

The following is a brief review of least squares optimization and constrained optimization techniques. Broadly, these techniques can be used in data analysis and visualization to examine the relationships between variables. Least squares (LS) problems are optimization problems in which the objective (error) function may be expressed as a sum of squares. Such problems have a natural relationship...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2021

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2021.3067307